public class MyCircularQueue {
    public int[] sums;
    int front = 0;
    int rear = 0 ;

    public MyCircularQueue(int k) {
        sums = new int[k+1];
    }

    public boolean enQueue(int value) {
        if (isFull()){
            return false;
        }
        sums[rear] = value;
        rear = (rear+1) % sums.length;
        return true;
    }

    public boolean deQueue() {
        if (isEmpty()){
            return false;
        }
        front = (front+1) % sums.length;
        return true;
    }

    public int Front() {
        if (isEmpty()){
            return -1;
        }
        return sums[front];
    }

    public int Rear() {
        if (isEmpty()){
            return -1;
        }
        int index = (rear == 0)? sums.length-1 :rear-1;
        return sums[index];
    }

    public boolean isEmpty() {
        return rear == front;
    }

    public boolean isFull() {
        return (rear+1)%sums.length == front;
    }
}
